|
In the study of scale-free networks, a copying mechanism is a process by which such a network can form and grow, by means of repeated steps in which nodes are duplicated with mutations from existing nodes. Several variations of copying mechanisms have been studied. In the general copying model, a growing network starts as a small initial graph and, at each time step, a new vertex is added with a given number ''k'' of new outgoing edges. As a result of a stochastic selection, the neighbors of the new vertex are either chosen randomly among the existing vertices, or one existing vertex is randomly selected and ''k'' of its neighbors are ‘copied’ as heads of the new edges.〔.〕 == Motivation == Copying mechanisms for modeling growth of the world wide web are motivated by the following intuition: *Some web page authors will note an interesting but novel commonality between certain pages, and will link to pages exhibiting this commonality; pages created with this motivation are modeled by a random choice among existing pages. *Most authors, on the other hand, will be interested in certain already-represented topics, and will collect together links to pages about these topics. Pages created in this way can be modeled by node copying. Those are the growth and preferential attachment properties of the networks. 抄文引用元・出典: フリー百科事典『 ウィキペディア（Wikipedia）』 ■ウィキペディアで「Copying mechanism」の詳細全文を読む スポンサード リンク
|